The Theory of the Metarecursively Enumerable Degrees

نویسنده

  • THEODORE A. SLAMAN
چکیده

Sacks [Sa1966a] asks if the metarecursively enumerable degrees are elementarily equivalent to the r.e. degrees. In unpublished work, Slaman and Shore proved that they are not. This paper provides a simpler proof of that result and characterizes the degree of the theory as O(ω) or, equivalently, that of the truth set of LωCK 1 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metarecursively Enumerable Sets and Admissible Ordinals

Here we describe some results which will be proved in detail in [13] and [l4]. The notion of metarecursive set was introduced in [8]. Kreisel [7] reported on some of the model-theoretic deliberations which preceded the definitions of [8]. Metarecursion theory is a generalization of ordinary recursion theory from the natural numbers to the recursive ordinals. Theorems about finite sets of natura...

متن کامل

ON c - AND P - RECURSMLY ENUMERABLE DEGREES

Several problems in recursion theory on admissible o¡dinals (a -recursion theory) and recursion theory on inadmissible ordinals (B -recursion theory) are studied. Fruitful interactions betweenboth theories are stressed. In the fr¡stpart the admissible collapse is used in order to characterizefor some inadmissible B the structure of all p -recursively enumerable degrees asanaccumulationof struct...

متن کامل

The Π3-theory of the Computably Enumerable Turing Degrees Is Undecidable

We show the undecidability of the Π3-theory of the partial order of computably enumerable Turing degrees.

متن کامل

The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees

The existence of isolated degrees was proved by Cooper and Yi in 1995 in [6], where a d.c.e. degree d is isolated by a c.e. degree a if a < d is the greatest c.e. degree below d. A computably enumerable degree c is non-isolating if no d.c.e. degree above c is isolated by c. Obviously, 0 is a non-isolating degree. Cooper and Yi asked in [6] whether there is a nonzero non-isolating degree. Arslan...

متن کامل

Extensions of Embeddings below Computably Enumerable Degrees

Toward establishing the decidability of the two quantifier theory of the ∆ 2 Turing degrees with join, we study extensions of embeddings of upper-semi-lattices into the initial segments of Turing degrees determined by computably enumerable sets, in particular the degree of the halting set 0. We obtain a good deal of sufficient and necessary conditions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006